Metric-Based Fractional Dimension of Rotationally-Symmetric Line Networks
نویسندگان
چکیده
The parameter of distance plays an important role in studying the properties symmetric networks such as connectedness, diameter, vertex centrality and complexity. Particularly different metric-based fractional models are used diverse fields computer science integer programming, pattern recognition, robot navigation. In this manuscript, we have computed all local resolving neighborhood sets established sharp bounds a dimension called by metric rotationally line wheel prism networks. Furthermore, bounded unboundedness these is also checked under when order approaches to infinity. lower upper analyzed using 3D shapes.
منابع مشابه
On the metric dimension of rotationally-symmetric convex polytopes∗
Metric dimension is a generalization of affine dimension to arbitrary metric spaces (provided a resolving set exists). Let F be a family of connected graphs Gn : F = (Gn)n ≥ 1 depending on n as follows: the order |V (G)| = φ(n) and lim n→∞ φ(n) = ∞. If there exists a constant C > 0 such that dim(Gn) ≤ C for every n ≥ 1 then we shall say that F has bounded metric dimension, otherwise F has unbou...
متن کاملOn the metric dimension and fractional metric dimension for hierarchical product of graphs
A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...
متن کاملRotationally Symmetric Rose Links
This paper is an introduction to rose links and some of their properties. We used a series of invariants to distinguish some rose links that are rotationally symmetric. We were able to distinguish all 3-component rose links and narrow the bounds on possible distinct 4 and 5-component rose links to between 2 and 8, and 2 and 16, respectively. An algorithm for drawing rose links and a table of ro...
متن کاملOn Minimum Metric Dimension of Circulant Networks
Let M = } ,..., , { 2 1 n v v v be an ordered set of vertices in a graph G. Then )) , ( ),..., , ( ), , ( ( 2 1 n v u d v u d v u d is called the M-coordinates of a vertex u of G. The set M is called a metric basis if the vertices of G have distinct M-coordinates. A minimum metric basis is a set M with minimum cardinality. The cardinality of a minimum metric basis of G is called minimum metric ...
متن کاملOn minimum metric dimension of honeycomb networks
A minimum metric basis is a minimum set W of vertices of a graph G(V,E) such that for every pair of vertices u and v of G, there exists a vertex w ∈ W with the condition that the length of a shortest path from u to w is different from the length of a shortest path from v to w. The honeycomb and hexagonal networks are popular mesh-derived parallel architectures. Using the duality of these networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15051069